翻訳と辞書 Words near each other ・ "O" Is for Outlaw ・ "O"-Jung.Ban.Hap. ・ "Ode-to-Napoleon" hexachord ・ "Oh Yeah!" Live ・ "Our Contemporary" regional art exhibition (Leningrad, 1975) ・ "P" Is for Peril ・ "Pimpernel" Smith ・ "Polish death camp" controversy ・ "Pro knigi" ("About books") ・ "Prosopa" Greek Television Awards ・ "Pussy Cats" Starring the Walkmen ・ "Q" Is for Quarry ・ "R" Is for Ricochet ・ "R" The King (2016 film) ・ "Rags" Ragland ・ ! (album) ・ ! (disambiguation) ・ !! ・ !!! ・ !!! (album) ・ !!Destroy-Oh-Boy!! ・ !Action Pact! ・ !Arriba! La Pachanga ・ !Hero ・ !Hero (album) ・ !Kung language ・ !Oka Tokat ・ !PAUS3 ・ !T.O.O.H.! ・ !Women Art Revolution Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク juggler sequence ： ウィキペディア英語版 juggler sequence In recreational mathematics a juggler sequence is an integer sequence that starts with a positive integer ''a''0, with each subsequent term in the sequence defined by the recurrence relation: :$a\_=\; \backslash begin$ \left \lfloor a_k^} \right \rfloor, & \mbox a_k \mbox \\ \\ \left \lfloor a_k^} \right \rfloor, & \mbox a_k \mbox. \end ==Background== Juggler sequences were publicised by American mathematician and author Clifford A. Pickover. The name is derived from the rising and falling nature of the sequences, like balls in the hands of a juggler. For example, the juggler sequence starting with ''a''0 = 3 is :$a\_1=\; \backslash lfloor\; 3^\backslash frac\; \backslash rfloor\; =\; \backslash lfloor\; 5.196\backslash dots\; \backslash rfloor\; =\; 5,$ :$a\_2=\; \backslash lfloor\; 5^\backslash frac\; \backslash rfloor\; =\; \backslash lfloor\; 11.180\backslash dots\; \backslash rfloor\; =\; 11,$ :$a\_3=\; \backslash lfloor\; 11^\backslash frac\; \backslash rfloor\; =\; \backslash lfloor\; 36.482\backslash dots\; \backslash rfloor\; =\; 36,$ :$a\_4=\; \backslash lfloor\; 36^\backslash frac\; \backslash rfloor\; =\; \backslash lfloor\; 6\; \backslash rfloor\; =\; 6,$ :$a\_5=\; \backslash lfloor\; 6^\backslash frac\; \backslash rfloor\; =\; \backslash lfloor\; 2.449\backslash dots\; \backslash rfloor\; =\; 2,$ :$a\_6=\; \backslash lfloor\; 2^\backslash frac\; \backslash rfloor\; =\; \backslash lfloor\; 1.414\backslash dots\; \backslash rfloor\; =\; 1.$ If a juggler sequence reaches 1, then all subsequent terms are equal to 1. It is conjectured that all juggler sequences eventually reach 1. This conjecture has been verified for initial terms up to 106,〔 *〕 but has not been proved. Juggler sequences therefore present a problem that is similar to the Collatz conjecture, about which Paul Erdős stated that "mathematics is not yet ready for such problems". For a given initial term ''n'', one defines ''l''(''n'') to be the number of steps which the juggler sequence starting at ''n'' takes to first reach 1, and ''h''(''n'') to be the maximum value in the juggler sequence starting at ''n''. For small values of ''n'' we have: : Juggler sequences can reach very large values before descending to 1. For example, the juggler sequence starting at ''a''0 = 37 reaches a maximum value of 24906114455136. Harry J. Smith has determined that the juggler sequence starting at ''a''0 = 48443 reaches a maximum value at ''a''60 with 972,463 digits, before reaching 1 at ''a''157.〔(Letter from Harry J. Smith to Cliiford A. Pickover, 27 June 1992 )〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「juggler sequence」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.